When is multidimensional screening a convex program?

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When Is Multidimensional Screening a Convex

A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis, quasi-linear utilities, and that agents can choose only pure strategies, we identify a structural condition on the value b(x, y) of product type y to agent type x — and on the princi...

متن کامل

When Is a Set of Lines in Space Convex?

The Definition of a Convex Set In Rd, a set S of points is convex if the line segment joining any two points of S lies completely within S (Figure 1). The purpose of this article is to describe a recent extension of this concept of convexity to the Grassmannian and to discuss its connection with some other ideas in geometry. More specifically, the extension is to the so-called “affine Grassmann...

متن کامل

A case when the union of polytopes is convex

We present a necessary and sufficient condition for the union of a finite number of convex polytopes in Rd to be convex. This generalises two theorems on convexity of the union of convex polytopes due to Bemporad et al. © 2004 Elsevier Inc. All rights reserved. AMS classification: Primary 52A20, 52A35; Secondary 52B11, 52B55

متن کامل

When every $P$-flat ideal is flat

In this paper‎, ‎we study the class of rings in which every $P$-flat‎ ‎ideal is flat and which will be called $PFF$-rings‎. ‎In particular‎, ‎Von Neumann regular rings‎, ‎hereditary rings‎, ‎semi-hereditary ring‎, ‎PID and arithmetical rings are examples of $PFF$-rings‎. ‎In the context domain‎, ‎this notion coincide with‎ ‎Pr"{u}fer domain‎. ‎We provide necessary and sufficient conditions for‎...

متن کامل

Consistency of Multidimensional Convex Regression

Convex regression is concerned with computing the best fit of a convex function to a data set of n observations in which the independent variable is (possibly) multi–dimensional. Such regression problems arise in operations research, economics, and other disciplines in which imposing a convexity constraint on the regression function is natural. This paper studies a least squares estimator that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Theory

سال: 2011

ISSN: 0022-0531

DOI: 10.1016/j.jet.2010.11.006